SURREAL: Subgraph Robust Representation Learning

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Subgraph Generation Improves Abstract Meaning Representation Parsing

The Abstract Meaning Representation (AMR) is a representation for opendomain rich semantics, with potential use in fields like event extraction and machine translation. Node generation, typically done using a simple dictionary lookup, is currently an important limiting factor in AMR parsing. We propose a small set of actions that derive AMR subgraphs by transformations on spans of text, which a...

متن کامل

Learning Robust Deep Face Representation

With the development of convolution neural network, more and more researchers focus their attention on the advantage of CNN for face recognition task. In this paper, we propose a deep convolution network for learning a robust face representation. The deep convolution net is constructed by 4 convolution layers, 4 max pooling layers and 2 fully connected layers, which totally contains about 4M pa...

متن کامل

Integration on Surreal Numbers

The thesis concerns the (class) structure No of Conway’s surreal numbers. The main concern is the behaviour on No of some of the classical functions of real analysis, and a definition of integral for such functions. In the main texts on No, most definitions and proofs are done by transfinite recursion and induction on the complexity of elements. In the thesis I consider a general scheme of defi...

متن کامل

Learning a Hidden Subgraph

We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of querie...

متن کامل

Early Active Learning via Robust Representation and Structured Sparsity

Labeling training data is quite time-consuming but essential for supervised learning models. To solve this problem, the active learning has been studied and applied to select the informative and representative data points for labeling. However, during the early stage of experiments, only a small number (or none) of labeled data points exist, thus the most representative samples should be select...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Network Science

سال: 2019

ISSN: 2364-8228

DOI: 10.1007/s41109-019-0160-1